A Large Term Rewrite System Modelling a Pioneering Cryptographic Algorithm
نویسندگان
چکیده
We present a term rewrite system that formallymodels theMessage Authenticator Algorithm (MAA), which was one of the first cryptographic functions for computing a Message Authentication Code and was adopted, between 1987 and 2001, in international standards (ISO 8730 and ISO 8731-2) to ensure the authenticity and integrity of banking transactions. Our term rewrite system is large (13 sorts, 18 constructors, 644 non-constructors, and 684 rewrite rules), confluent, and terminating. Implementations in thirteen different languages have been automatically derived from this model and used to validate 200 official test vectors for the MAA.
منابع مشابه
Utilisation des langages d'arbres pour la modélisation et la vérification des systèmes à états infinis
This document presents different tools to represent and manipulate infinitsets of tree tuples called tree tuple languages. We choose logic programming as formalismto describe tree tuple languages (i.e relations) and logic program transformation techniquesfor computing operations on them. In a first step we study a class of relation closed underusual sets operations, the class of...
متن کاملNotes on Lynch-Morawska Systems
In this paper we investigate convergent term rewriting systems that conform to the criteria set out by Christopher Lynch and Barbara Morawska in their seminal paper “Basic Syntactic Mutation.” The equational unification problem modulo such a rewrite system is solvable in polynomial-time. In this paper, we derive properties of such a system which we call an LM-system. We show, in particular, tha...
متن کاملDifferential Power Analysis: A Serious Threat to FPGA Security
Differential Power Analysis (DPA) implies measuring the supply current of a cipher-circuit in an attempt to uncover part of a cipher key. Cryptographic security gets compromised if the current waveforms obtained correlate with those from a hypothetical power model of the circuit. As FPGAs are becoming integral parts of embedded systems and increasingly popular for cryptographic applications and...
متن کاملVariant Narrowing and Equational Unification
Narrowing is a well-known complete procedure for equational E-unification when E can be decomposed as a union E = ∆ ] B with B a set of axioms for which a finitary unification algorithm exists, and ∆ a set of confluent, terminating, and B-coherent rewrite rules. However, when B 6= ∅, effective narrowing strategies such as basic narrowing easily fail to be complete and cannot be used. This poses...
متن کاملA Robust Feedforward Active Noise Control System with a Variable Step-Size FxLMS Algorithm: Designing a New Online Secondary Path Modelling Method
Several approaches have been introduced in literature for active noise control (ANC)systems. Since Filtered-x-Least Mean Square (FxLMS) algorithm appears to be the best choice as acontroller filter. Researchers tend to improve performance of ANC systems by enhancing andmodifying this algorithm. This paper proposes a new version of FxLMS algorithm. In many ANCapplications an online secondary pat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017